Using simulated annealing to construct extremal graphs
نویسندگان
چکیده
منابع مشابه
Simulated Annealing and Its Problems to Color Graphs
Simulated Annealing is a very successful heuristic for various problems in combinatorial optimization. In this paper an application of Simulated Annealing to the 3-coloring problem is considered. In contrast to many good empirical results we will show for a certain class of graphs that the expected rst hitting time of a proper coloring, given an arbitrary cooling scheme, is of exponential size....
متن کاملUsing Simulated Annealing to Design Interconnection Networks
Simulated annealing is a computational technique reported to give good results in coping with complex combinatorial problems. These problems usually consist of finding a global minimum of a cost function on a (large) set of states (also known as feasible solutions). In this paper we explore modifications to the standard simulated annealing method that we apply to the design of dense interconnec...
متن کاملUsing simulated annealing to design good codes
A NNEAL, as defined in Webster’s New Collegiate Dictionary, means: 1) to heat (as glass) in order to fix laid-on colors, and 2) to heat and then cool (as steel or glass) usually for softening and making less brittle. The cooling stage of annealing is usually done slowly to reduce the number of defects in the crystal structure (as steel) and to minimize the potential energy stored in the molecul...
متن کاملPhase Balancing using Simulated Annealing
Deregulation eliminates the boundary of the territory of the monopoly power industry. Competition forces utilities to improve power quality as well as to reduce investment and operation costs. Feeder imbalance describes a situation in which the voltages of a three-phase voltage source are not identical in magnitude, or the phase differences between them are not 120 electrical degrees, or both. ...
متن کاملInstruction Scheduling Using Simulated Annealing
Most nodes of modern massively-parallel computing systems contain processors that use instruction-level parallelism to increase the speed of the individual processor. In order to achieve the greatest speedup possible, the compiler must perform instruction scheduling so that instructions are presented to the processor in the order that is most efficient. Instruction scheduling is a compiler prob...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: Discrete Mathematics
سال: 2001
ISSN: 0012-365X
DOI: 10.1016/s0012-365x(00)00265-x